Semantics for Temporal Annotated Constraint Logic Programming

We investigate semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms. After illustrating the power of TACLP with some non-trivial examples, TACLP is given two different kinds of semantics, an operational one based on meta-logic (top-down semantics) and, for the first time, a fixpoint one based on an immediate consequence operator (bottom-up semantics). We prove the top-down semantics to be sound and complete with respect to the bottom-up semantics.